Intensification/Diversification-Driven ILS for a Graph Coloring Problem
نویسنده
چکیده
منابع مشابه
An ILS algorithm for the Robust Coloring Problem
This paper studies the Robust Coloring Problem (RCP), a variant of the Minimal Coloring Problem which maintains the number of colors fixed. In this problem, two non-adjacent vertex that have the same color are penalized. The sum of penalties of a coloring is called rigidity level. To solve the RCP, an Iterated Local Search (ILS) algorithm using the Random Variable Neighborhood Descent (RVND) lo...
متن کاملLocal Search for a complex combinatorial problem
Iterated Local Search (ILS) is a popular metaheuristic search technique for use on combinatorial optimisation problems. As with most such techniques, there are many ways in which ILS can be implemented. The aim of this paper is to shed light on the best variants and choice of parameters when using ILS on a complex combinatorial problem with many objectives, by reporting on the results of an exh...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملAlgorithmes Heuristiques et Techniques d'Apprentissage : Applications au Problème de Coloration de Graphe. (Heuristic Algorithms And Learning Techniques : Applications to the Graph Coloring Problem)
The last couple of decades have seen a surge of interest and sophistication in us-ing heuristics to solve combinatorial optimization problems. However, the theoretical andpractical research of these algorithms show there are many important challenges yet tobe overcome – e.g. it seems that it is quite difficult to make a heuristic integrate a globalvision over its own evolution o...
متن کاملNew Low Cost and Undedicated Genetic Operators
The mutation and cross-over operators are, with selection, the foundation of genetic algorithms. We show in this paper, some possibilities offered by these operators. Having explained the specificity of the most known operators (1-point, p-point and uniform cross-over, classical and deterministic mutation) we introduce new crossover and mutation operators with a low cost in term of execution ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012